Dynamic programming algorithm for optimum manpower recruitment policy
نویسندگان
چکیده
منابع مشابه
Optimal manpower recruitment by stochastic programming in graded manpower systems
Human resource is one of the most effective resources in the development of any organization or a Nation. Optimal utilization of manpower is a pivotal challenge to a manager of a dynamic management system. Achieving the objectives by meeting the constraints on various feasibilities is the core problem before statisticians, model developers and OR scientists. In this paper we develop a model wit...
متن کاملOptimum Pricing Policy for Dynamic
In this paper we study the effect of dynamic behavior of the market on the optimum pricing policy for a revenue maximizing firm in a monopoly market. We show that the optimum pricing policy in the dynamic market can be very different from the static one, and the most important contributing factors for this difference are: consumer response time, planning period and the discount rate. Furt...
متن کاملAn Efficient Policy Iteration Algorithm for Dynamic Programming Equations
We present an accelerated algorithm for the solution of static Hamilton-JacobiBellman equations related to optimal control problems. Our scheme is based on a classic policy iteration procedure, which is known to have superlinear convergence in many relevant cases provided the initial guess is sufficiently close to the solution. This limitation often degenerates into a behavior similar to a valu...
متن کاملBuilding a Dynamic Manpower Planning Model: Focused on the Information Security Manpower Policy of Korea
The ability to forecast manpower requirements is crucial for an industry. On the demand side, companies rely on these forecasts to formulate their manpower planning strategies, while, on the supply side, they provide job seekers with a basis to assess the attractiveness of a given sector. Forecasts of supply and demand for manpower also make an important contribution to the governmental policy-...
متن کاملDynamic policy programming
In this paper, we propose a novel policy iteration method, called dynamic policy programming (DPP), to estimate the optimal policy in the infinite-horizon Markov decision processes. DPP is an incremental algorithm that forces a gradual change in policy update. This allows to prove finite-iteration and asymptotic l∞-norm performance-loss bounds in the presence of approximation/estimation error w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Global Journal of Mathematical Sciences
سال: 2009
ISSN: 1596-6208
DOI: 10.4314/gjmas.v7i2.45188